Proof of a mutual exclusion algorithm—a classic example
نویسندگان
چکیده
منابع مشابه
Proof of Peterson’s algorithm for mutual exclusion∗
4 Checking the model 6 4.1 Validation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 4.2 Mutual exclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.3 Liveness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.4 Freedom from starvation . . . . . . . . . . . . . . . . . . . . . . . 8 4.5 Results . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملA Compositional Proof of a Real-Time Mutual Exclusion Protocol
In this paper, we apply a compositional proof technique to an automatic verification of the correctness of Fischer’s mutual exclusion protocol. It is demonstrated that the technique may avoid the state–explosion problem. Our compositional technique has recently been implemented in a tool CMC, which gives experimental evidence that the size of the verification effort required of the technique on...
متن کاملProof of a Real-Time Mutual-Exclusion Algorithm
Michael Fischer has proposed a mutual exclusion algorithm that ingeniously exploits real time. We prove this algorithm using the time-honored technique of establishing an appropriate invariant.
متن کاملProof of a Real { Time Mutual Exclusion Protocol K
In this paper, we apply a compositional proof technique to an automatic veri cation of the correctness of Fischer's mutual exclusion protocol. It is demonstrated that the technique may avoid the state{ explosion problem. Our compositional technique has recently been implemented in a tool CMC 5 , which veri es the protocol for 50 processes within 172.3 seconds and using only 32MB main memory. In...
متن کاملWhen does a correct mutual exclusion algorithm guarantee mutual exclusion?
Dijkstra introduced mutual exclusion for an N -process system as the requirement “that at any moment only one of these N cyclic processes is in its critical section” [1]. This requirement, which we call true mutual exclusion, is still the standard definition of mutual exclusion. Mutual exclusion algorithms for shared-memorymultiprocessors do not guarantee true mutual exclusion. We give a simple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGOPS Operating Systems Review
سال: 1990
ISSN: 0163-5980
DOI: 10.1145/90994.91002